// 最长连续递增序列
var findLengthOfLCIS = function(nums) {
    const n = nums.length
    let maxLen = 1, count = 1
    for (let i = 0; i < n; i++) {
    if   ( nums[i] - nums[i+1] < 0 ){ // 是递增  
        count++
        
    } else {  // 不是递增
        count = 1
    }

    maxLen = count > maxLen ? count : maxLen
    }
    return maxLen
}
